% Example to generate the coverpage of a CW or TW report with CWTWcover.sty
\documentclass{article}
\usepackage{CWTWcover}
%
% you will get an overful vbox warning if you try to
% put too much in the cover window (title too long, too many authors)
% put too much on the cover page (abstract too long)
%

% The effect of \thanks (See LaTeX) can be suppressed on the coverpage.
% This is the norm if title and authors also appear on the second page.
\nothanks

\title{Parser Combinators in Scala}
\author{Adriaan Moors \and Frank Piessens \and Martin Odersky}

% give the date
\date{Feb 2008}

% give the number of the report (either CW or TW, but not both)
\CW{491}
%\Report{Something else than CW or TW} %to be used only if all else fails

\begin{document}
\begin{coverpage}

\begin{abstract}
\begin{quotation}	
Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are implemented as a library in Scala, a functional object-oriented language. Thanks to Scala's flexible syntax, we are able to closely approximate the EBNF notation supported by dedicated parser generators. For the uninitiated, we first explain the concept of parser combinators by developing a minimal library from scratch. We then turn to the existing Scala library, and discuss its features using various examples.
\end{quotation}
\end{abstract}

\end{coverpage}
\end{document}
